Computation of Conditional Expectations with Guarantees
نویسندگان
چکیده
Abstract Theoretically, the conditional expectation of a square-integrable random variable Y given d -dimensional vector X can be obtained by minimizing mean squared distance between and f ( ) over all Borel measurable functions $$f :\mathbb {R}^d \rightarrow \mathbb {R}$$ f : R d → . However, in many applications this minimization problem cannot solved exactly, instead, numerical method which computes an approximate minimum suitable subfamily has to used. The quality result depends on adequacy performance method. In paper, we derive expected value representation minimal efficiently approximated with standard Monte Carlo average. This enables us provide guarantees for accuracy any approximation expectation. We illustrate assessing expectations linear, polynomial neural network regression different concrete examples.
منابع مشابه
Randomized online computation with high probability guarantees
We study the relationship between the competitive ratio and the tail distribution of randomized online minimization problems. To this end, we define a broad class of online problems that includes some of the well-studied problems like paging, k-server and metrical task systems on finite metrics, and show that for these problems it is possible to obtain, given an algorithm with constant expected...
متن کاملConditional Expectations and Renormalization
In optimal prediction methods one estimates the future behavior of underresolved systems by solving reduced systems of equations for expectations conditioned by partial data; renormalization group methods reduce the number of variables in complex systems through integration of unwanted scales. We establish the relation between these methods for systems in thermal equilibrium, and use this relat...
متن کاملThe Specification of Conditional Expectations
This paper explores different speciÞcations of conditional expectations. The most common speciÞcation, linear least squares, is contrasted with nonparametric techniques that make no assumptions about the distribution of the data. Nonparametric regression is successful in capturing some nonlinearities in Þnancial data, in particular, asymmetric responses of security returns to the direction and ...
متن کاملOnline Bin Covering: Expectations vs. Guarantees
Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin. For online bin covering, competitive analysis fails to distinguish between most algorithms of interest; all “reasonable” algorithms have a competitive ratio of 1 2 . Thus, in order to get a better understandin...
متن کاملEffective dynamics using conditional expectations
The question of coarse-graining is ubiquitous in molecular dynamics. In this article, we are interested in deriving effective properties for the dynamics of a coarse-grained variable ξ(x), where x describes the configuration of the system in a high-dimensional space R, and ξ is a smooth function with value in R (typically a reaction coordinate). It is well known that, given a Boltzmann-Gibbs di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2023
ISSN: ['1573-7691', '0885-7474']
DOI: https://doi.org/10.1007/s10915-023-02130-8